A Uniied Framework for Solving Boolean, Integer and Set Constraints
نویسنده
چکیده
In this short paper, a uniied framework for solving Boolean, integer and set constraints is presented. The computation model for solving conjunctions of primitive constraints, possibly with existential and universal quantiications, is described using rewrite rules. An important feature of the constraint solving model is that a variable's domain (set of integers) can be a constrained variable (set variable). Based on such a strong extension, set constraints and dynamic constraints are introduced. Integer constraints , Boolean logic and set reasoning are combined perfectly in a single constraint solver.
منابع مشابه
Programming with the Declic Language
We present in this paper Declic, a new Constraint Logic Programming Language solving systems mixing boolean, integer and real constraints in the uniied framework of intervals. Declic achieves cooperation of specialized solvers over the diierent domains involved , one of its key feature being the cooperation of a solver enforcing box-consistency 5] by means of Newton methods, with a solver enfor...
متن کاملConsistent Answers to Boolean Aggregate Queries under Aggregate Constraints
A framework for computing consistent answers to boolean aggregate queries in numerical databases violating a given set of aggregate constraints is introduced. Both aggregate constraints and queries are aggregation expressions consisting of linear inequalities on aggregate-sum functions. In particular, our approach works for a specific but expressive form of aggregation expressions (called stead...
متن کاملExploiting Constraints
Constraints can be exploited in paradigms outside of constraint programming. In particular, powerful global constraints can often be decomposed into small primitives and these decompositions can simulate complex propagation algorithms that perform sophisticated inference about a problem. We illustrate this approach with examples of exploiting constraints in propositional satisfiability (SAT), p...
متن کاملSolving parity games by a reduction to SAT
This paper presents a reduction from the problem of solving parity games to the satisfiability problem in propositional logic (SAT). The reduction is done in two stages, first into difference logic, i.e. SAT combined with the theory of integer differences, an instance of the SAT modulo theories (SMT) framework. In the second stage the integer variables and constraints of the difference logic en...
متن کاملOn Solving Optimization Problems Using Boolean Satisfiability
The last few years have seen significant advances in Boolean satisfiability (SAT) solving. This has lead to the successful deployment of SAT solvers in a wide range of problems in Engineering and Computer Science. In general, most SAT solvers are applied to Boolean decision problems that are expressed in conjunctive normal form (CNF). While this input format is applicable to some engineering ta...
متن کامل